منابع مشابه
Green is Simpler than Grue ∗
Goodman’s grue-bleen paradox relies on the claim that the predicate “green” is not simpler than the predicate “grue”, and that, for that reason, the choice between them is arbitrary. It is argued that this claim can only be made in a restricted model, in which functions have primitive names but particular values do not. In more natural models, which allow values to have proper names as well, th...
متن کاملGoodman, 'grue' and Hempel*
It is now commonly accepted that N. Goodman's predicate "grue" presents the theory of confirmation of C. G. Hempel (and other such theories) with grave difficulties. The precise nature and status of these "difficulties" has, however, never been made clear. In this paper it is argued that it is very unlikely that "grue" raises any formal difficulties for Hempel and appearances to the contrary ar...
متن کاملGoodman’s “Grue” Argument in Historical Perspective
I will focus on arguments against classical deductive and inductive logic (“relevantist” and “grue” arguments). The talk is mainly defensive. I won’t offer positive accounts of the “paradoxical” cases I will discuss (but, see “Extras”). I’ll begin with Harman’s defense of classical deductive logic against certain (epistemological) “relevantist” arguments. Then, I’ll argue that if you like Harma...
متن کاملLars Chittka
set up to see who can catch the most. The Environment Education Foundation hosted its third ‘lionfish derby’ last month off Florida, outside the reserve, with more than $3,000 in prize money for the team catching the most fish — 109 were killed. In the waters around the Bahamas, which don’t have the same protection as Florida Keys, more than 2,000 lionfish have been killed over the past two yea...
متن کاملGraph Theory By Lars
This development provides a formalization of directed graphs, supporting (labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges to be treated as pairs of vertices, if multi-edges are not required. Formalized properties are i.a. walks (and related concepts), connectedness and subgraphs and basic properties of isomorphisms. This formalization is used to prove characteriz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Norsk sosiologisk tidsskrift
سال: 2017
ISSN: 2535-2512
DOI: 10.18261/issn.2535-2512-2017-03-07